Ascending Combinatorial Scoring Auctions

نویسنده

  • Thomas Rieck
چکیده

In multi-attribute procurement auctions with multiple objects, the auctioneer may care about the interplay of quality attributes that do not belong to the same item – like each item’s delivery time, if all items are needed at once. This can influence the performance of the auction mechanism. We generalize the Ausubel-Milgrom ascending proxy auction to such an environment and show that the main properties still hold: Equilibria in profit-target strategies exist, the final allocation maximizes the surplus and the payoff vector is in the core. Furthermore, the scoring rule used to evaluate the bids may contain valuable information about the auctioneer for his competitors, providing an incentive not to reveal it. In our setting, it is possible to keep the scoring rule secret without changing the outcome of the auction. Additionally, for additive scoring rules a close connection to the original proxy auction exists. JEL: D44, D82

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Vickrey-Target Strategy and the Core in Ascending Combinatorial Auctions

This paper considers a general class of combinatorial auctions with ascending prices, which includes the Vickrey-Clarke-Groves mechanism and core-selecting auctions. We analyze incentives in ascending combinatorial auctions under complete and perfect information. We show that in every ascending auction, the “Vickrey-target strategy” constitutes a subgame perfect equilibrium with a restricted st...

متن کامل

Walrasian's Characterization and a Universal Ascending Auction

We introduce a novel characterization of all Walrasian price vectors in terms of forbidden overand under demanded sets for monotone gross substitute combinatorial auctions. For ascending and descending auctions we suggest a universal framework for finding the minimum or maximum Walrasian price vectors for monotone gross substitute combinatorial auctions. An ascending (descending) auction is gua...

متن کامل

Ascending Combinatorial Auctions with Allocation Constraints: On Game Theoretical and Computational Properties of Generic Pricing Rules

Combinatorial auctions are used in a variety of application domains such as transportation or industrial procurement using a variety of bidding languages and different allocation constraints. This flexibility in the bidding languages and the allocation constraints is essential in these domains, but has not been considered in the theoretical literature so far. In this paper, we analyze different...

متن کامل

Ascending price Vickrey auctions for general valuations

Ascending price auctions typically involve a single price path with buyers paying their final bid price. Using this traditional definition, no ascending price auction can achieve the Vickrey-Clarke-Groves (VCG) outcome for general private valuations in the combinatorial auction setting. We relax this definition by allowing discounts to buyers from the final price of the auction (or alternativel...

متن کامل

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009